David Shmoys - PDFSEARCH.IO - Document Search Engine

David Shmoys
Results: 19

#	Item
11	Stochastic Scheduling on Unrelated Machines ∗ Martin Skutella1 , Maxim Sviridenko2 , and Marc Uetz3 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2014-02-19 09:36:13 Scheduling Decision theory Design of experiments Gittins index Stochastic process Stochastic optimization Linear programming Stochastic David Shmoys Statistics Operations research Mathematical sciences
12	An Approximation Algorithm for Scheduling Aircraft with Holding Time Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2007-01-10 20:12:20 Applied mathematics Job shop scheduling Dynamic programming Linear programming David Shmoys Mathematical optimization Operations research Mathematics
13	Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1 Michael Christ James Demmel Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2013-05-14 20:12:13 Matrix Abelian group Rank Ring Linear programming David Shmoys Rank-into-rank Algebra Mathematics Abstract algebra
14	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-30 06:01:55 Algorithms Linear programming Randomized rounding Probabilistic complexity theory Linear programming relaxation Randomized algorithm Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
15	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
16	Fault-Tolerant Clustering in Ad Hoc and Sensor Networks Fabian Kuhn Microsoft Research Silicon Valley 1065 La Avenida Mountain View, CA[removed]removed] Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-04-05 09:53:00 Binary trees NP-complete problems Dominating set Randomized rounding Randomized algorithm Rope David Shmoys Tango tree Theoretical computer science Computational complexity theory Mathematics
17	RANDOM SAMPLING IN GRAPH OPTIMIZATION PROBLEMS Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-10-17 00:28:32 Spanning tree Algorithms Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
18	PDF Document Add to Reading List Source URL: www.acsu.buffalo.edu Language: English - Date: 2001-10-29 09:27:44 Theoretical computer science Combinatorial optimization Linear programming NP-complete problems Generalized assignment problem Relaxation Cutting-plane method Assignment problem David Shmoys Mathematical optimization Operations research Mathematics
19	PDF Document Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2011-10-07 12:47:37 Computer science Applied mathematics K-server problem Randomized algorithm Metrical task system SL Competitive analysis Adversary model David Shmoys Online algorithms Theoretical computer science Analysis of algorithms

UPDATE